Semantic enhanced Top-k similarity search on weighted HIN
نویسندگان
چکیده
Abstract Similarity searches on heterogeneous information networks (HINs) have attracted wide attention from both industrial and academic areas in recent years; for example, they been used friend detection social collaborator recommendation coauthor networks. The structural the HIN can be captured by multiple metapaths, people usually utilize metapaths to design methods similarity search. rich semantics HINs are not only but also content stored nodes. However, of nodes was valued existing methods. Although some researchers recently considered types machine learning-based search, structure separately. To address this issue balancing influence flexibly process searching, we propose a double channel convolutional neural network model top-k which uses path instances as inputs generates embeddings based different metapaths. We an mechanism enhance differences each node. Another is combine Finally, importance evaluation function designed improve accuracy make more explainable. experimental results show that our search algorithm effectively support achieve higher performance than approaches.
منابع مشابه
Scaling up top-K cosine similarity search
Article history: Received 21 September 2009 Received in revised form 23 August 2010 Accepted 23 August 2010 Available online 8 September 2010 Recent years have witnessed an increased interest in computing cosine similarity in many application domains. Most previous studies require the specification of a minimum similarity threshold to perform the cosine similarity computation. However, it is us...
متن کاملPanther: Fast Top-k Similarity Search in Large Networks
Jing Zhang†, Jie Tang†], Cong Ma†, Hanghang Tong‡, Yu Jing†, and Juanzi Li† †Department of Computer Science and Technology, Tsinghua University Tsinghua National Laboratory for Information Science and Technology (TNList) ‡School of Computing, Informatics, and Decision Systems Engineering, ASU {zhangjing12, ma-c11}@mails.tsinghua.edu.cn, {jietang, yujing5b5d,lijuanzi}@tsinghua.edu.cn, hanghang.t...
متن کاملDiversified Top-k Similarity Search in Large Attributed Networks
Given a large network and a query node, finding its top-k similar nodes is a primitive operation in many graphbased applications. Recently enhancing search results with diversification have received much attention. In this paper, we explore an novel problem of searching for top-k diversified similar nodes in attributed networks, with the motivation that modeling diversification in an attributed...
متن کاملTop-k Semantic Caching
The subject of this thesis is the intelligent caching of top-k queries in an environment with high latency and low throughput. In such an environment, caching can be used to reduce network traffic and improve response time. Slow database connections of mobile devices and to databases, which have been offshored, are practical use cases. A semantic cache is a query-based cache that caches query r...
متن کاملFast top-k similarity join for SimRank
SimRank is a well-studied similarity measure between two nodes in a network. However, evaluating SimRank of all nodes in a network is not only time-consuming but also not pragmatic, since users are only interested in the most similar pairs in many real-world applications. This paper focuses on topk similarity join based on SimRank. In this work, we first present an incremental algorithm for com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computing and Applications
سال: 2022
ISSN: ['0941-0643', '1433-3058']
DOI: https://doi.org/10.1007/s00521-022-07339-6